A Read - Only Distributed Hash Table Verdi March
ثبت نشده
چکیده
منابع مشابه
DGRID: A DHT-Based Resource Indexing and Discovery Scheme for Computational Grids
Traditional DHT (Distributed Hash Tables) abstraction distributes data items among peer nodes on a structured overlay network. This introduces a number of issues when nodes are under different administrative authorities. In this paper, we propose DGRID, a new DHT abstraction for grid resource indexing and discovery where an administrative domain stores only its own data items. This is achieved ...
متن کاملEtna: a Fault-tolerant Algorithm for Atomic Mutable DHT Data
This paper presents Etna, an algorithm for atomic reads and writes of replicated data stored in a distributed hash table. Etna correctly handles dynamically changing sets of replica hosts, and is optimized for reads, writes, and reconfiguration, in that order. Etna maintains a series of replica configurations as nodes in the system change, using new sets of replicas from the pool supplied by th...
متن کاملA peer-to-peer replica magement service for high-throughput Grids
Future high-throughput Grids may integrate millions or even billions of processing and data storage nodes. Services provided by the underlying Grid infrastructure may have to be able to scale to capacities not even imaginable today. In this paper we concentrate on one of the core components of the Data Grid architecture the Replica Location Service and evaluate a redesign of the system based on...
متن کاملComputer Science and Artificial Intelligence Laboratory Etna: A Fault-tolerant Algorithm for Atomic Mutable DHT Data
This paper presents Etna, an algorithm for atomic reads and writes of replicated data stored in a distributed hash table. Etna correctly handles dynamically changing sets of replica hosts, and is optimized for reads, writes, and reconfiguration, in that order. Etna maintains a series of replica configurations as nodes in the system change, using new sets of replicas from the pool supplied by th...
متن کاملUsenetDHT: A Low Overhead Usenet Server
UsenetDHT is a system that reduces the storage and bandwidth resources required to run a Usenet server by spreading the burden of data storage across participants. UsenetDHT distributes data using a distributed hash table. The amount of data that must be stored on each node participating in UsenetDHT scales inversely with the number of participating nodes. Each node’s bandwidth requirements are...
متن کامل